Generalizations of lattices via non-deterministic operators
نویسندگان
چکیده
منابع مشابه
Generalizations of lattices via non-deterministic operators
Benado (Čehoslovak.Mat. Ž. 79(4) (1954) 105–129) and later Hansen (DiscreteMath. 33(1) (1981) 99–101) have offered an algebraic characterization of multilattice (i.e., a poset where every pair of elements satisfies that any upper bound is greater than or equal to a minimal upper bound, and also satisfies the dual property). To that end, they introduce two algebraic operators that are a generali...
متن کاملDeterministic and Non-deterministic Basis Reduction Techniques for Ntru Lattices
Author: Daniel Socek Title: Deterministic and Non-Deterministic Basis Reduction Techniques for NTRU Lattices Institution: Florida Atlantic University Thesis Advisor: Dr. Spyros S. Magliveras Degree: Master of Science Year: 2002 Finding the shortest or a “short enough” vector in an integral lattice of substantial dimension is a difficult problem. The problem is not known to be but most people be...
متن کاملSome properties of b-weakly compact operators on Banach lattices
In this paper we give some necessary and sufficient conditions for which each Banach lattice is space and we study some properties of b-weakly compact operators from a Banach lattice into a Banach space . We show that every weakly compact operator from a Banach lattice into a Banach space is b-weakly compact and give a counterexample which shows that the inverse is not true but we prove ...
متن کاملAxiomatic generalizations of OWA operators
Axiomatic generalizations of OWA operators are introduces and discussed. First, OMA operators based on comonotone modularity are recalled. Then, several kinds of comonotone pseudoadditivity based OWA generalizations are characterized and exemplified. Some of already known OWA generalizations are thus seen from new points of view. In several cases an integral representation of generalized OWA op...
متن کاملTransforming Lattices into Non-deterministic Automata with Optional Null Arcs
The problem of transforming a lattice into a non-deterministic finite state automaton is non-trivial. We present a transformation algorithm which tracks, for each node of an automaton under construction, the larcs which it reflects and the lattice nodes at their origins and extremities. An extension of the algorithm permits the inclusion of null, or epsilon, arcs in the output automaton. The al...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2005
ISSN: 0012-365X
DOI: 10.1016/j.disc.2004.08.043